Cell Decomposition and Dimension Functions in First-order Topological Structures
نویسنده
چکیده
The notion of a cell and that of a cell decomposition has been a central one in the study of certain first-order theories. A cell is a particular kind of definable set. The notion of a cell was first explicitly considered in [8], in the context of the theory of real closed fields. Collins defined a class of cells in this context, and showed that every definable subset of a real closed field is a finite disjoint union of cells. This property is often referred to as a cell decomposition for definable sets. The definable subsets of a real closed field are precisely the semi-algebraic sets (see [6]), and therefore this notion of a cell is of considerable importance in real algebraic geometry. Real closed fields are the principal examples of o-minimal structures. These have been extensively studied by model theorists during the last decade, and in this connection it was readily noticed that the notion of a cell was appropriate to the study of definable sets in this more general context. It was shown by van den Dries in [14] that o-minimal expansions of the real ordered field admit a cell decomposition for definable sets. However, Knight, Pillay and Steinhorn proved more generally in [19] that any o-minimal structure whatever admits a cell decomposition for definable sets. The notion of cell for o-minimal structures in [19] makes sense for linearly ordered structures, but a related notion was subsequently considered in a different context, that of the first-order theory of the p-adic numbers. Denef introduced a notion of cell appropriate to Qp in [10], and showed that any definable subset of Qp in the language of rings is a finite disjoint union of cells. By analogy with the real case, definable subsets of p-adically closed fields (structures elementarily equivalent to Qp) are often referred to as p-adic semi-algebraic sets. By contrast, however, a satisfactory analogue of an o-minimal structure in the p-adic setting has yet to be developed, much less an analogue of the cell decomposition for o-minimal structures in [19]. The structure of p-adic semi-algebraic sets was studied extensively by van den Dries and Scowcroft in [30]. They proved a result concerning the structure of definable subsets of Qp which, though weaker than the cell decomposition result in [10], is the basis for the work in this paper. We give a definition of cell (Definition 6.2) which makes sense in the context of any first-order structure in which there exists a definable topology, a first-order topological structure in the terminology of [24]. We also define in this context the Cell Decomposition
منابع مشابه
Decomposition of H*-Algebra Valued Negative Definite Functions on Topological *-Semigroups
In the present paper, among other results, a decomposition formula is given for the w-bounded continuous negative definite functions of a topological *-semigroup S with a weight function w into a proper H*-algebra A in terms of w-bounded continuous positive definite A-valued functions on S. A generalization of a well-known result of K. Harzallah is obtained. An earlier conjecture of the author ...
متن کاملIntroduction to O-minimal Structures and an Application to Neural Network Learning
1. Definition of o-minimality and first examples 1 2. Basic real analysis and the monotonicity theorem 4 3. Definable Skolem functions and elimination of imaginaries 8 4. Dimension, part 1 10 5. Cell decomposition 11 6. Dimension, part 2 15 7. Restricted analytic functions and global exponentiation 17 8. NIP and neural networks 20 8.1. Vapnik-Chervonenkis dimension 20 8.2. O-minimal structures ...
متن کاملFurther notes on cell decomposition in closed ordered differential fields
In [BMR05] the authors proved a theorem of cell decomposition for the theory CODF of closed ordered differential fields which generalize the usual Cell Decomposition Theorem for o-minimal structures. As a consequence of this result, a particularly well-behaving dimension function on definable sets in CODF was introduced. Here we carry on the study of this cell decomposition in CODF by proving t...
متن کاملFree Vibration Analysis of Repetitive Structures using Decomposition, and Divide-Conquer Methods
This paper consists of three sections. In the first section an efficient method is used for decomposition of the canonical matrices associated with repetitive structures. to this end, cylindrical coordinate system, as well as a special numbering scheme were employed. In the second section, divide and conquer method have been used for eigensolution of these structures, where the matrices are in ...
متن کاملFuzzy particle swarm optimization with nearest-better neighborhood for multimodal optimization
In the last decades, many efforts have been made to solve multimodal optimization problems using Particle Swarm Optimization (PSO). To produce good results, these PSO algorithms need to specify some niching parameters to define the local neighborhood. In this paper, our motivation is to propose the novel neighborhood structures that remove undesirable niching parameters without sacrificing perf...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995